An adjacent graph is a connected bipartite {0,1}-semigraph which contains exactly one part in which any two vertices have exactly one common neighbour. Mulder [1] observed that; (0, λ) -semigraphs are regular. Furthermore a lower bound for the degree of (0,n)-semi graphs with diameter at least four was derived by Mulder [1]. In this paper, we find all -graphs and (0,1)-graphs. Furthermore, we determined some basic properties of adjacent graphs, where, λ≥1.a
[1] Busacker, R.G. and Saaty, T.L.: Finite Graphs and Networks, McGraw-
[2] Ä°brahim Günaltılı, “Pseudo-complements in finite projective plane”, Ars Combinatoria, Vol. 96, October (2010). [SCI Index Expanded].
[3] Ä°brahim Günaltılı and P. Anapa, “Conditional Linear Spaces with two Consecutive Line Degrees”, Far East Journal Math. Sci.(FJMS), Volume 35, pp.57-70 (2010).
[4] Ä°brahim Günaltılı “On classification of finite linear spaces”, New Trends in Mathematical Sciences, Vol. 3. No. 4. 104-113 (2015)
[5] Ä°brahim Günaltılı “Embedding the complement of a complete graph in a finite projective plane” Konuralp Journal of Mathematics, Volume 3 No. 1. Pp. 130-134 (2015).
[6] Ä°brahim Günaltılı “Finite Regular {0,1}- bigraphs” Procedia-Social and Behavioral Sciences 89, pp. 529-532 (2013).
[7] Ä°brahim Günaltılı “Some Properties of Finite {0,1}-graphs” Konuralp Journal of Mathematics, Volume 1 No. 1. Pp. 34-39 (2013).
Cites this article as
I. GUNALTILI
"Classification of Some {0,1}-Semigraphs", International Journal of Innovative Research in Computer Science and Technology (IJIRCST), Vol-4, no.1, pp.10-12, 2016. Available from:
